An adaptive routing strategy for freight transportation networks
نویسندگان
چکیده
We introduce an adaptive routing strategy (ARS) for transportation networks. In this strategy, the route choice is made adaptively based on the real-time information of the whole system. An efficient optimization-based heuristic is proposed to support such real-time decision-making process. Numerical results show that our ARS outperforms both the static routing method and the original dynamic routing method. Journal of the Operational Research Society (2011) 62, 799–805. doi:10.1057/jors.2010.7 Published online 21 April 2010
منابع مشابه
An On-line Freight Network Assignment Model with Transportation Disruptions and Recourse
Continuous real-time monitoring of shipment cost and delivery time is increasingly used by companies to reduce transportation costs while avoiding costly delays or disruptions. Recourse refers to the ability of the shipper to update his/her routing strategy depending on information obtained about the state of the network disruptions. This research proposes an adaptive routing policy that will h...
متن کاملA mathematical model for hazmat and freight transportation in railway networks
In this paper, we develop a freight transportation model for railway network considering hazmat transportation issue. In the transportation system considered, different customers can request for carrying hazmat and non- hazmat boxes. It is assumed that the sequence of the trains in the network is known. The objective is assigning the non-hazmat boxes and hazmat boxes to wagons of the trains so ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملModel for Network Assignment Problem of Capacitated Freight with Disruptions Integer Multicommodity Flow with Recourse
mends the use of travel time values for congested periods that are 2.5 times the value of time estimates during uncongested periods (7). Kawamura investigated differences in value of time among operators and trucking industry segments; findings from Kawamura’s research show that freight carriers have a value of time that is several times higher than that of passenger vehicles and that there is ...
متن کاملDesigning Incomplete Hub Location-routing Network in Urban Transportation Problem
In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JORS
دوره 62 شماره
صفحات -
تاریخ انتشار 2011